Strong normalization of classical natural deduction with disjunctions
نویسندگان
چکیده
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper also proves strong normalization of classical natural deduction with general elimination rules for implication and conjunction, and their permutative conversions. This paper also proves natural deduction can be embedded into natural deduction with general elimination rules, strictly preserving proof normalization.
منابع مشابه
A short proof of the Strong Normalization of Classical Natural Deduction with Disjunctio
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
متن کاملStrong normalization proofs by CPS-translations
In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system λμ→∧∨⊥ , which is introduced in [3] by de Groote and corresponds to the classical natural deduction with disjunctions and permutative conversions by the Curry-Howard isomorphism. For our method, we introduce a new CPS-translati...
متن کاملA short proof of the strong normalization of classical natural deduction with disjunction
We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.
متن کاملA semantical proof of the strong normalization theorem for full propositional classical natural deduction
We give in this paper a short semantical proof of the strong normalization for full propositional classical natural deduction. This proof is an adaptation of reducibility candidates introduced by J.-Y. Girard and simplified to the classical case by M. Parigot.
متن کاملStrong normalization results by translation
We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed λμ-calculus. We also extend Mendler’s result on recursive equations to this system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 153 شماره
صفحات -
تاریخ انتشار 2008